Characterization of apartments in polar Grassmannians
نویسندگان
چکیده
منابع مشابه
Characterization of apartments in polar Grassmannians
Buildings of types Cn and Dn are defined by rank n polar spaces. The associated building Grassmannians are polar and half-spin Grassmannians. Apartments in dual polar spaces and half-spin Grassmannians were characterized in [4]. We characterize apartments in all polar Grassmannians consisting of non-maximal singular subspaces. This characterization is a partial case of more general results conc...
متن کاملOrthogonal Apartments in Hilbert Grassmannians
Let H be an infinite-dimensional complex Hilbert space and let L(H) be the logic formed by all closed subspaces of H. For every natural k we denote by Gk(H) the Grassmannian consisting of k-dimensional subspaces. An orthogonal apartment of Gk(H) is the set consisting of all k-dimensional subspaces spanned by subsets of a certain orthogonal base of H. Orthogonal apartments can be characterized a...
متن کاملOn hyperovals of polar Grassmannians
A hyperoval of a point-line geometry is a nonempty set of points meeting each line in either 0 or 2 points. In this paper, we study hyperovals in line Grassmannians of finite polar spaces of rank 3, hereby often imposing some extra regularity conditions. We determine an upper bound and two lower bounds for the size of such a hyperoval. If equality occurs in one of these bounds, then there is an...
متن کاملBase subsets of polar Grassmannians
Let ∆ be a thick building of type Xn = Cn,Dn. Let also Gk be the Grassmannian of k-dimensional singular subspaces of the associated polar space Π (of rank n). We write Gk for the corresponding shadow space of type Xn,k. Every bijective transformation of Gk preserving the class of base subsets (the shadows of apartments) is a collineation of Gk, and it is induced by a collineation of Π if n 6= 4...
متن کاملPolar Grassmannians and their Codes
We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2012
ISSN: 1370-1444
DOI: 10.36045/bbms/1337864278